Dichotomies and reducibility
نویسندگان
چکیده
منابع مشابه
Development Dichotomies
THE WORLD IS DIVIDED into two groups of people: those who divide the world into two groups of people, and those who don't. As I evidently belong to the former, I believe that the nature of various divisions can throw light on what has come to be known as the rise and decline of development economics. Albert Hirschman, in his stimulating contribution to the international symposium on Latin Ameri...
متن کاملMetric Dichotomies
These are notes from talks given at ICMS, Edinburgh, 4/2007 (“Geometry and Algorithms workshop”) and at Bernoulli Center, Lausanne 5/2007 (“Limits of graphs in group theory and computer science”). We survey the following type of dichotomies exhibited by certain classes X of finite metric spaces: For every host space H, either all metrics in X embed almost isometrically in H, or the distortion o...
متن کاملAntichains and counterpoint dichotomies
We construct a special type of antichain (i.e., a family of subsets of a set, such that no subset is contained in another) using grouptheoretical considerations, and obtain an upper bound on the cardinality of such an antichain. We apply the result to bound the number of strong counterpoint dichotomies up to affine isomorphisms.
متن کاملRandomness and Reducibility
How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like? The goal of this paper is to look at questions like these, specifically by studying the properties of reducibilities that act as measures of relative randomness, as embodied in the concept of initia...
متن کاملReducibility and Completeness
There is little doubt that the notion of reducibility is the most useful tool that complexity theory has delivered to the rest of the computer science community. For most computational problems that arise in real-world applications, such as the Traveling Salesperson Problem, we still know little about their deterministic time or space complexity. We cannot now tell whether classes such as P and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 1967
ISSN: 0022-0396
DOI: 10.1016/0022-0396(67)90014-9